The monomorphism problem in free groups
نویسندگان
چکیده
Let F be a free group of finite rank. We say that the monomorphism problem in F is decidable if there is an algorithm such that, for any two elements u and v in F , it determines whether there exists a monomorphism of F that sends u to v. In this paper we show that the monomorphism problem is decidable and we provide an effective algorithm that solves the problem. Mathematics Subject Classification (2000). Primary 20E05, 68Q25.
منابع مشابه
Groups and Ultra-groups
In this paper, in addition to some elementary facts about the ultra-groups, which their structure based on the properties of the transversal of a subgroup of a group, we focus on the relation between a group and an ultra-group. It is verified that every group is an ultra-group, but the converse is not true generally. We present the conditions under which, for every normal subultra-group of an u...
متن کاملPo-S-Dense Monomorphism
In this paper we take $mathcal A$ to be the category {bf Pos-S} of $S$-posets, for a posemigroup $S$, ${mathcal M}_{pd}$ to be the class of partially ordered sequantially-dense monomorphisms and study the categorical properties, such as limits and colimits, of this class. These properties are usually needed to study the homological notions, such as injectivity, of $S$-...
متن کاملOn the Continuous Cohomology of Diffeomorphism Groups
Suppose that M is a connected orientable n-dimensional manifold and m > 2n. If H(M, R) = 0 for i > 0, it is proved that for each m there is a monomorphism Hm(Wn, O(n)) → H m cont(Diff M, R). If M is closed and oriented, it is proved that for each m there is a monomorphism Hm(Wn, O(n)) → H m−n cont (Diff+ M, R), where Diff+ M is the group of orientation preserving diffeomorphisms of M . 2000 Mat...
متن کاملمسیریابی حرکت روباتهای ماشینواره با روش پیشروی سریع
The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...
متن کاملAbstract Initiality
initiality Lutz Schröder, Horst Herrlich Abstract. We study morphisms that are initial w.r.t. all functors in a given conglomerate. Several results and counterexamples are obtained concerning the relation of such properties to different notions of subobject. E.g., strong monomorphisms are initial w.r.t. all faithful adjoint functors, but not necessarily w.r.t. all faithful monomorphism-preservi...
متن کامل